TSTP Solution File: PUZ092^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : PUZ092^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 08:49:10 EDT 2024
% Result : Theorem 0.22s 0.39s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 44 ( 7 unt; 0 def)
% Number of atoms : 385 ( 365 equ)
% Maximal formula atoms : 64 ( 8 avg)
% Number of connectives : 555 ( 214 ~; 191 |; 123 &)
% ( 5 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 6 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 12 con; 0-0 aty)
% Number of variables : 84 ( 36 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f59,plain,
$false,
inference(avatar_sat_refutation,[],[f41,f46,f47,f56,f57,f58]) ).
fof(f58,plain,
( ~ spl12_4
| ~ spl12_5 ),
inference(avatar_split_clause,[],[f27,f53,f49]) ).
fof(f49,plain,
( spl12_4
<=> sK3 = sK0 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_4])]) ).
fof(f53,plain,
( spl12_5
<=> sK6 = sK11 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_5])]) ).
fof(f27,plain,
( sK3 != sK0
| sK6 != sK11 ),
inference(trivial_inequality_removal,[],[f25]) ).
fof(f25,plain,
( sK2 != sK2
| sK7 != sK7
| sK3 != sK0
| sK6 != sK11 ),
inference(definition_unfolding,[],[f11,f14,f15,f13,f16,f12]) ).
fof(f12,plain,
sK5 = sK6,
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
( ( sK3 != sK8
| sK10 != sK7
| sK5 != sK6
| sK4 != sK0 )
& ( sK6 != sK7
| sK1 != sK0
| sK4 != sK2
| sK3 = sK8 )
& ( sK9 != sK3
| sK6 != sK7
| sK8 != sK11
| sK4 = sK0
| sK3 != sK11 )
& ( sK6 = sK7
| sK8 != sK11
| sK9 = sK1
| sK4 != sK2 )
& sK4 = sK2
& sK9 = sK3
& sK10 = sK7
& sK1 = sK0
& sK5 = sK6
& ( sK10 != sK7
| sK9 != sK1
| sK4 != sK2
| sK5 != sK11 )
& sK8 = sK11
& ( sK5 = sK11
| sK6 = sK7
| sK1 != sK0
| sK9 != sK3
| sK3 != sK1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8,sK9,sK10,sK11])],[f6,f7]) ).
fof(f7,plain,
( ? [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] :
( ( X3 != X8
| X7 != X10
| X5 != X6
| X0 != X4 )
& ( X6 != X7
| X0 != X1
| X2 != X4
| X3 = X8 )
& ( X3 != X9
| X6 != X7
| X8 != X11
| X0 = X4
| X3 != X11 )
& ( X6 = X7
| X8 != X11
| X1 = X9
| X2 != X4 )
& X2 = X4
& X3 = X9
& X7 = X10
& X0 = X1
& X5 = X6
& ( X7 != X10
| X1 != X9
| X2 != X4
| X5 != X11 )
& X8 = X11
& ( X5 = X11
| X6 = X7
| X0 != X1
| X3 != X9
| X1 != X3 ) )
=> ( ( sK3 != sK8
| sK10 != sK7
| sK5 != sK6
| sK4 != sK0 )
& ( sK6 != sK7
| sK1 != sK0
| sK4 != sK2
| sK3 = sK8 )
& ( sK9 != sK3
| sK6 != sK7
| sK8 != sK11
| sK4 = sK0
| sK3 != sK11 )
& ( sK6 = sK7
| sK8 != sK11
| sK9 = sK1
| sK4 != sK2 )
& sK4 = sK2
& sK9 = sK3
& sK10 = sK7
& sK1 = sK0
& sK5 = sK6
& ( sK10 != sK7
| sK9 != sK1
| sK4 != sK2
| sK5 != sK11 )
& sK8 = sK11
& ( sK5 = sK11
| sK6 = sK7
| sK1 != sK0
| sK9 != sK3
| sK3 != sK1 ) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
? [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] :
( ( X3 != X8
| X7 != X10
| X5 != X6
| X0 != X4 )
& ( X6 != X7
| X0 != X1
| X2 != X4
| X3 = X8 )
& ( X3 != X9
| X6 != X7
| X8 != X11
| X0 = X4
| X3 != X11 )
& ( X6 = X7
| X8 != X11
| X1 = X9
| X2 != X4 )
& X2 = X4
& X3 = X9
& X7 = X10
& X0 = X1
& X5 = X6
& ( X7 != X10
| X1 != X9
| X2 != X4
| X5 != X11 )
& X8 = X11
& ( X5 = X11
| X6 = X7
| X0 != X1
| X3 != X9
| X1 != X3 ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
? [X7,X0,X10,X4,X9,X11,X5,X3,X8,X6,X2,X1] :
( ( X4 != X8
| X2 != X3
| X5 != X11
| X7 != X9 )
& ( X3 != X5
| X0 != X7
| X9 != X10
| X4 = X8 )
& ( X4 != X6
| X3 != X5
| X1 != X8
| X7 = X9
| X1 != X4 )
& ( X3 = X5
| X1 != X8
| X0 = X6
| X9 != X10 )
& X9 = X10
& X4 = X6
& X2 = X3
& X0 = X7
& X5 = X11
& ( X2 != X3
| X0 != X6
| X9 != X10
| X1 != X11 )
& X1 = X8
& ( X1 = X11
| X3 = X5
| X0 != X7
| X4 != X6
| X0 != X4 ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
? [X8,X0,X10,X7,X6,X2,X9,X4,X1,X11,X3,X5] :
( X5 = X11
& X2 = X3
& X4 = X6
& X1 = X8
& X9 = X10
& X0 = X7
& ( X1 = X11
| X3 = X5
| X0 != X7
| X0 != X4
| X4 != X6 )
& ( X3 != X5
| X7 = X9
| X4 != X6
| X1 != X8
| X1 != X4 )
& ( X3 = X5
| X1 != X8
| X0 = X6
| X9 != X10 )
& ( X4 = X8
| X3 != X5
| X0 != X7
| X9 != X10 )
& ( X1 != X11
| X9 != X10
| X2 != X3
| X0 != X6 )
& ( X7 != X9
| X2 != X3
| X4 != X8
| X5 != X11 ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ! [X8,X0,X10,X7,X6,X2,X9,X4,X1,X11,X3,X5] :
( ( ( ( X3 != X5
& X0 = X7
& X0 = X4
& X4 = X6 )
=> X1 = X11 )
& ( ( X7 != X9
& X4 = X6
& X1 = X8
& X1 = X4 )
=> X3 != X5 )
& ( ( X1 = X8
& X0 != X6
& X9 = X10 )
=> X3 = X5 )
& ( ( X3 = X5
& X0 = X7
& X9 = X10 )
=> X4 = X8 )
& ( ( X9 = X10
& X2 = X3
& X0 = X6 )
=> X1 != X11 )
& ( ( X2 = X3
& X4 = X8
& X5 = X11 )
=> X7 != X9 ) )
=> ( X5 != X11
| X2 != X3
| X4 != X6
| X1 != X8
| X9 != X10
| X0 != X7 ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X2,X6,X10,X11,X4,X8,X5,X3,X7,X0,X1,X9] :
( ( ( ( X2 = X4
& X8 != X11
& X4 = X5
& X2 = X3 )
=> X6 = X9 )
& ( ( X2 = X5
& X0 = X1
& X10 = X11 )
=> X6 != X9 )
& ( ( X4 = X6
& X4 = X5
& X6 = X7
& X0 != X3 )
=> X8 != X11 )
& ( ( X2 != X5
& X0 = X1
& X6 = X7 )
=> X8 = X11 )
& ( ( X0 = X1
& X8 = X11
& X2 = X3 )
=> X4 = X7 )
& ( ( X10 = X11
& X8 = X9
& X4 = X7 )
=> X0 != X3 ) )
=> ( X8 != X9
| X10 != X11
| X6 != X7
| X0 != X1
| X4 != X5
| X2 != X3 ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X2,X6,X10,X11,X4,X8,X5,X3,X7,X0,X1,X9] :
( ( ( ( X2 = X4
& X8 != X11
& X4 = X5
& X2 = X3 )
=> X6 = X9 )
& ( ( X2 = X5
& X0 = X1
& X10 = X11 )
=> X6 != X9 )
& ( ( X4 = X6
& X4 = X5
& X6 = X7
& X0 != X3 )
=> X8 != X11 )
& ( ( X2 != X5
& X0 = X1
& X6 = X7 )
=> X8 = X11 )
& ( ( X0 = X1
& X8 = X11
& X2 = X3 )
=> X4 = X7 )
& ( ( X10 = X11
& X8 = X9
& X4 = X7 )
=> X0 != X3 ) )
=> ( X8 != X9
| X10 != X11
| X6 != X7
| X0 != X1
| X4 != X5
| X2 != X3 ) ),
file('/export/starexec/sandbox/tmp/tmp.qzmmcyJpFG/Vampire---4.8_30574',cSIXFRIENDS_EASIER) ).
fof(f16,plain,
sK4 = sK2,
inference(cnf_transformation,[],[f8]) ).
fof(f13,plain,
sK1 = sK0,
inference(cnf_transformation,[],[f8]) ).
fof(f15,plain,
sK9 = sK3,
inference(cnf_transformation,[],[f8]) ).
fof(f14,plain,
sK10 = sK7,
inference(cnf_transformation,[],[f8]) ).
fof(f11,plain,
( sK10 != sK7
| sK9 != sK1
| sK4 != sK2
| sK5 != sK11 ),
inference(cnf_transformation,[],[f8]) ).
fof(f57,plain,
( spl12_2
| spl12_4 ),
inference(avatar_split_clause,[],[f28,f49,f38]) ).
fof(f38,plain,
( spl12_2
<=> sK6 = sK7 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_2])]) ).
fof(f28,plain,
( sK3 = sK0
| sK6 = sK7 ),
inference(trivial_inequality_removal,[],[f24]) ).
fof(f24,plain,
( sK6 = sK7
| sK11 != sK11
| sK2 != sK2
| sK3 = sK0 ),
inference(definition_unfolding,[],[f17,f10,f15,f13,f16]) ).
fof(f10,plain,
sK8 = sK11,
inference(cnf_transformation,[],[f8]) ).
fof(f17,plain,
( sK6 = sK7
| sK8 != sK11
| sK9 = sK1
| sK4 != sK2 ),
inference(cnf_transformation,[],[f8]) ).
fof(f56,plain,
( ~ spl12_4
| spl12_5
| spl12_2 ),
inference(avatar_split_clause,[],[f29,f38,f53,f49]) ).
fof(f29,plain,
( sK6 = sK11
| sK3 != sK0
| sK6 = sK7 ),
inference(trivial_inequality_removal,[],[f26]) ).
fof(f26,plain,
( sK6 = sK7
| sK0 != sK0
| sK6 = sK11
| sK3 != sK3
| sK3 != sK0 ),
inference(definition_unfolding,[],[f9,f12,f13,f15,f13]) ).
fof(f9,plain,
( sK5 = sK11
| sK6 = sK7
| sK1 != sK0
| sK9 != sK3
| sK3 != sK1 ),
inference(cnf_transformation,[],[f8]) ).
fof(f47,plain,
( ~ spl12_1
| ~ spl12_3 ),
inference(avatar_split_clause,[],[f30,f43,f34]) ).
fof(f34,plain,
( spl12_1
<=> sK3 = sK11 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_1])]) ).
fof(f43,plain,
( spl12_3
<=> sK2 = sK0 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_3])]) ).
fof(f30,plain,
( sK3 != sK11
| sK2 != sK0 ),
inference(trivial_inequality_removal,[],[f21]) ).
fof(f21,plain,
( sK3 != sK11
| sK6 != sK6
| sK2 != sK0
| sK7 != sK7 ),
inference(definition_unfolding,[],[f20,f10,f14,f12,f16]) ).
fof(f20,plain,
( sK3 != sK8
| sK10 != sK7
| sK5 != sK6
| sK4 != sK0 ),
inference(cnf_transformation,[],[f8]) ).
fof(f46,plain,
( ~ spl12_2
| ~ spl12_1
| spl12_3 ),
inference(avatar_split_clause,[],[f31,f43,f34,f38]) ).
fof(f31,plain,
( sK6 != sK7
| sK3 != sK11
| sK2 = sK0 ),
inference(trivial_inequality_removal,[],[f23]) ).
fof(f23,plain,
( sK6 != sK7
| sK3 != sK11
| sK11 != sK11
| sK3 != sK3
| sK2 = sK0 ),
inference(definition_unfolding,[],[f18,f15,f10,f16]) ).
fof(f18,plain,
( sK9 != sK3
| sK6 != sK7
| sK8 != sK11
| sK4 = sK0
| sK3 != sK11 ),
inference(cnf_transformation,[],[f8]) ).
fof(f41,plain,
( spl12_1
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f32,f38,f34]) ).
fof(f32,plain,
( sK6 != sK7
| sK3 = sK11 ),
inference(trivial_inequality_removal,[],[f22]) ).
fof(f22,plain,
( sK2 != sK2
| sK0 != sK0
| sK3 = sK11
| sK6 != sK7 ),
inference(definition_unfolding,[],[f19,f13,f16,f10]) ).
fof(f19,plain,
( sK6 != sK7
| sK1 != sK0
| sK4 != sK2
| sK3 = sK8 ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PUZ092^5 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n018.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 18:01:38 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a TH0_THM_EQU_NAR problem
% 0.15/0.37 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.qzmmcyJpFG/Vampire---4.8_30574
% 0.22/0.39 % (30860)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.22/0.39 % (30861)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.22/0.39 % (30859)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.22/0.39 % (30862)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.22/0.39 % (30863)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.22/0.39 % (30864)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.22/0.39 % (30867)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.22/0.39 % (30862)Instruction limit reached!
% 0.22/0.39 % (30862)------------------------------
% 0.22/0.39 % (30862)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (30862)Termination reason: Unknown
% 0.22/0.39 % (30862)Termination phase: Function definition elimination
% 0.22/0.39
% 0.22/0.39 % (30862)Memory used [KB]: 1023
% 0.22/0.39 % (30862)Time elapsed: 0.003 s
% 0.22/0.39 % (30862)Instructions burned: 2 (million)
% 0.22/0.39 % (30862)------------------------------
% 0.22/0.39 % (30862)------------------------------
% 0.22/0.39 % (30863)Instruction limit reached!
% 0.22/0.39 % (30863)------------------------------
% 0.22/0.39 % (30863)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (30863)Termination reason: Unknown
% 0.22/0.39 % (30863)Termination phase: Function definition elimination
% 0.22/0.39
% 0.22/0.39 % (30863)Memory used [KB]: 1023
% 0.22/0.39 % (30863)Time elapsed: 0.003 s
% 0.22/0.39 % (30863)Instructions burned: 2 (million)
% 0.22/0.39 % (30863)------------------------------
% 0.22/0.39 % (30863)------------------------------
% 0.22/0.39 % (30860)First to succeed.
% 0.22/0.39 % (30864)Also succeeded, but the first one will report.
% 0.22/0.39 % (30867)Also succeeded, but the first one will report.
% 0.22/0.39 % (30860)Refutation found. Thanks to Tanya!
% 0.22/0.39 % SZS status Theorem for Vampire---4
% 0.22/0.39 % SZS output start Proof for Vampire---4
% See solution above
% 0.22/0.39 % (30860)------------------------------
% 0.22/0.39 % (30860)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (30860)Termination reason: Refutation
% 0.22/0.39
% 0.22/0.39 % (30860)Memory used [KB]: 5500
% 0.22/0.39 % (30860)Time elapsed: 0.005 s
% 0.22/0.39 % (30860)Instructions burned: 1 (million)
% 0.22/0.39 % (30860)------------------------------
% 0.22/0.39 % (30860)------------------------------
% 0.22/0.39 % (30857)Success in time 0.005 s
% 0.22/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------